Ordering optimization of host machines in a computing environment based on policies

ABSTRACT

Dynamically setting the order of optimization of physical hosts allows more efficient and varied optimization. An ordering policy mechanism utilizes ordering policies to set an order for the optimizer to optimize physical the hosts. The ordering policy mechanism may allow a system administrator to create and/or select ordering policies. The ordering policies may include fixed ordering policies or dynamic ordering policies.

BACKGROUND

1. Technical Field

This invention generally relates to virtual machines in a computing environment, and more specifically relates to optimization of physical hosts for virtual machines in a computing environment using one or more policies that define ordering of the optimization.

2. Background Art

Cloud computing is a common expression for distributed computing over a network and can also be used with reference to network-based services such as Infrastructure as a Service (IaaS). IaaS is a cloud based service that provides physical processing resources to run virtual machines (VMs) as a guest for different customers. The virtual machine may host a user application or a server.

A computing environment, such as a cloud computing environment, may have a large number of physical machines that can each host one or more virtual machines. Prior art cloud management tools allow a system administrator to assist in determining a specific physical host in which to place or deploy a new virtual machine. After deployment, the cloud management tools optimize the system by moving one or more virtual machines to a different physical host. The placement of the new virtual machine initially and during optimization may be determined by a placement policy selected by the system administrator. Prior art placement policies also include aggressiveness policies that define settings for aggressiveness of optimization.

BRIEF SUMMARY

An apparatus and method for dynamically setting the order of optimization of physical hosts allows more efficient and varied optimization. An ordering policy mechanism utilizes ordering policies to set an order for the optimizer to optimize the hosts. The ordering policy mechanism may allow a system administrator to create and/or select ordering policies. The ordering policies may include fixed ordering policies or dynamic ordering policies.

The foregoing and other features and advantages of the invention will be apparent from the following more particular description of preferred embodiments of the invention, as illustrated in the accompanying drawings.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

The disclosure will be described in conjunction with the appended drawings, where like designations denote like elements, and:

FIG. 1 is a block diagram of a cloud computing node;

FIG. 2 is a block diagram of a cloud computing environment;

FIG. 3 is a block diagram of abstraction model layers;

FIG. 4 is a block diagram that illustrates a computer system with an ordering policy mechanism as described herein that dynamically changes the order of optimization of physical hosts;

FIG. 5 is a block diagram that illustrates a simplified example of dynamically changing the order of optimization of physical hosts;

FIG. 6 is a flow diagram of a method for dynamically selecting the order of optimization of physical hosts as described herein; and

FIG. 7 is a flow diagram of an example method for step 630 in FIG. 6.

DETAILED DESCRIPTION

The claims and disclosure herein describe changing the order of optimization of physical hosts to allow more efficient and varied optimization. An ordering policy mechanism utilizes ordering policies to set an order for the optimizer to optimize the hosts. The ordering policy mechanism may allow a system administrator to create and/or select ordering policies. The ordering policy mechanism described herein may be used in conjunction with prior art policies for placement of virtual machines or policies that determine what host needs to be optimized and/or defines the aggressiveness of optimization.

It is understood in advance that although this disclosure includes a detailed description on cloud computing, implementation of the teachings recited herein are not limited to a cloud computing environment. Rather, embodiments of the present invention are capable of being implemented in conjunction with any other type of computing environment now known or later developed.

Cloud computing is a model of service delivery for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g. networks, network bandwidth, servers, processing, memory, storage, applications, virtual machines, and services) that can be rapidly provisioned and released with minimal management effort or interaction with a provider of the service. This cloud model may include at least five characteristics, at least three service models, and at least four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provision computing capabilities, such as server time and network storage, as needed automatically without requiring human interaction with the service's provider.

Broad network access: capabilities are available over a network and accessed through standard mechanisms that promote use by heterogeneous thin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to serve multiple consumers using a multi-tenant model, with different physical and virtual resources dynamically assigned and reassigned according to demand. There is a sense of location independence in that the consumer generally has no control or knowledge over the exact location of the provided resources but may be able to specify location at a higher level of abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elastically provisioned, in some cases automatically, to quickly scale out and rapidly released to quickly scale in. To the consumer, the capabilities available for provisioning often appear to be unlimited and can be purchased in any quantity at any time.

Measured service: cloud systems automatically control and optimize resource use by leveraging a metering capability at some level of abstraction appropriate to the type of service (e.g., storage, processing, bandwidth, and active user accounts). Resource usage can be monitored, controlled, and reported providing transparency for both the provider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer is to use the provider's applications running on a cloud infrastructure. The applications are accessible from various client devices through a thin client interface such as a web browser (e.g., web-based email). The consumer does not manage or control the underlying cloud infrastructure including network, servers, operating systems, storage, or even individual application capabilities, with the possible exception of limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer is to deploy onto the cloud infrastructure consumer-created or acquired applications created using programming languages and tools supported by the provider. The consumer does not manage or control the underlying cloud infrastructure including networks, servers, operating systems, or storage, but has control over the deployed applications and possibly application hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to the consumer is to provision processing, storage, networks, and other fundamental computing resources where the consumer is able to deploy and run arbitrary software, which can include operating systems and applications. The consumer does not manage or control the underlying cloud infrastructure but has control over operating systems, storage, deployed applications, and possibly limited control of select networking components (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for an organization. It may be managed by the organization or a third party and may exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by several organizations and supports a specific community that has shared concerns (e.g., mission, security requirements, policy, and compliance considerations). It may be managed by the organizations or a third party and may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the general public or a large industry group and is owned by an organization selling cloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or more clouds (private, community, or public) that remain unique entities but are bound together by standardized or proprietary technology that enables data and application portability (e.g., cloud bursting for loadbalancing between clouds).

A cloud computing environment is service oriented with a focus on statelessness, low coupling, modularity, and semantic interoperability. At the heart of cloud computing is an infrastructure comprising a network of interconnected nodes.

Referring now to FIG. 1, a block diagram of an example of a cloud computing node is shown. Cloud computing node 100 is only one example of a suitable cloud computing node and is not intended to suggest any limitation as to the scope of use or functionality of embodiments of the invention described herein. Regardless, cloud computing node 100 is capable of being implemented and/or performing any of the functionality set forth hereinabove.

In cloud computing node 100 there is a computer system/server 110, which is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with computer system/server 110 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, handheld or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above systems or devices, and the like.

Computer system/server 110 may be described in the general context of computer system executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types. Computer system/server 110 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.

As shown in FIG. 1, computer system/server 110 in cloud computing node 100 is shown in the form of a general-purpose computing device. The components of computer system/server 110 may include, but are not limited to, one or more processors or processing units 120, a system memory 130, and a bus 122 that couples various system components including system memory 130 to processor 120.

Bus 122 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.

Computer system/server 110 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer system/server 110, and it includes both volatile and non-volatile media, removable and non-removable media.

System memory 130 can include computer system readable media in the form of volatile, such as random access memory (RAM) 134, and/or cache memory 136. Computer system/server 110 may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system 140 can be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”). Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media can be provided. In such instances, each can be connected to bus 122 by one or more data media interfaces. As will be further depicted and described below, memory 130 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions described in more detail below.

Program/utility 150, having a set (at least one) of program modules 152, may be stored in memory 130 by way of example, and not limitation, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating system, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment. Program modules 152 generally carry out the functions and/or methodologies of embodiments of the invention as described herein.

Computer system/server 110 may also communicate with one or more external devices 190 such as a keyboard, a pointing device, a display 180, a disk drive, etc.; one or more devices that enable a user to interact with computer system/server 110; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 110 to communicate with one or more other computing devices. Such communication can occur via Input/Output (I/O) interfaces 170. Still yet, computer system/server 110 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 160. As depicted, network adapter 160 communicates with the other components of computer system/server 110 via bus 122. It should be understood that although not shown, other hardware and/or software components could be used in conjunction with computer system/server 110. Examples, include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data archival storage systems, etc.

Referring now to FIG. 2, illustrative cloud computing environment 200 is depicted. As shown, cloud computing environment 200 comprises one or more cloud computing nodes 100 with which local computing devices used by cloud consumers, such as, for example, personal digital assistant (PDA) or cellular telephone 210A, desktop computer 210B, laptop computer 210C, and/or automobile computer system 210N may communicate. Nodes 100 may communicate with one another. They may be grouped (not shown) physically or virtually, in one or more networks, such as Private, Community, Public, or Hybrid clouds as described hereinabove, or a combination thereof. This allows cloud computing environment 200 to offer infrastructure, platforms and/or software as services for which a cloud consumer does not need to maintain resources on a local computing device. It is understood that the types of computing devices 210A-N shown in FIG. 2 are intended to be illustrative only and that computing nodes 100 and cloud computing environment 200 can communicate with any type of computerized device over any type of network and/or network addressable connection (e.g., using a web browser).

Referring now to FIG. 3, a set of functional abstraction layers provided by cloud computing environment 200 (FIG. 2) is shown. It should be understood in advance that the components, layers, and functions shown in FIG. 3 are intended to be illustrative only and the disclosure and claims are not limited thereto. As depicted, the following layers and corresponding functions are provided.

Hardware and software layer 310 includes hardware and software components. Examples of hardware components include mainframes 352; RISC (Reduced Instruction Set Computer) architecture based servers 354; servers 356; blade servers 358; storage devices 360; and networks and networking components 362. In some embodiments, software components include network application server software 364 and database software 366.

Virtualization layer 320 provides an abstraction layer from which the following examples of virtual entities may be provided: virtual servers 368; virtual storage 370; virtual networks 372, including virtual private networks; virtual applications and operating systems 374; and virtual clients 376.

In one example, management layer 330 may provide the functions described below. Resource provisioning 378 provides dynamic procurement of computing resources and other resources that are utilized to perform tasks within the cloud computing environment. Metering and Pricing 380 provide cost tracking as resources are utilized within the cloud computing environment, and billing or invoicing for consumption of these resources. In one example, these resources may comprise application software licenses. Security provides identity verification for cloud consumers and tasks, as well as protection for data and other resources. User portal 382 provides access to the cloud computing environment for consumers and system administrators. Service level management 384 provides cloud computing resource allocation and management such that required service levels are met. Service Level Agreement (SLA) planning and fulfillment 386 provide pre-arrangement for, and procurement of, cloud computing resources for which a future requirement is anticipated in accordance with an SLA. The management layer further includes an order policy mechanism (OPM) 350 as described herein. While the OPM 350 is shown in FIG. 3 to reside in the management layer 330, the OPM 350 actually may span other levels shown in FIG. 3 as needed.

Workloads layer 340 provides examples of functionality for which the cloud computing environment may be utilized. Examples of workloads and functions which may be provided from this layer include: mapping and navigation 386; software development and lifecycle management 390; virtual classroom education delivery 392; data analytics processing 394; transaction processing 396 and mobile desktop 398.

The present invention may be a system, a method, and/or a computer program product at any possible technical detail level of integration. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

Referring now to FIG. 4, a block diagram illustrates an ordering policy mechanism (OPM) 350 that was introduced above with reference to FIG. 3. The OPM 350 dynamically changes the order of optimization of physical hosts. In the illustrated example, the OPM 350 is part of a cloud manager 410. The cloud manager 410 may be similar to cloud managers known in the prior art but includes the additional features of the order policy mechanism 350 as described herein. The cloud manager 410 allows a human user or system administrator 412 to set up and manage computer resources through a user interface 414. The cloud manager 410 implements the cloud management functions 330 described above with reference to FIG. 3. The order policy mechanism 350 may be incorporated into a scheduler (not shown) which manages migration of VMs to physical hosts as known in the prior art.

Again referring to FIG. 4, the cloud manager 410 includes an optimizer 416. The optimizer 416 determines an optimum location for the placement of virtual machines for load balancing and other needs of the system. The optimizer 416 may operate similarly to prior art optimizers except as described herein. The optimizer 416 monitors VM and host performance and allows the scheduler (not shown) to migrate VMs to other hosts according to optimization policies 418 set by the system administrator 412. The optimization policies 418 are policies similar to those in the prior art to optimize placement of the virtual machines on hosts 440 in the computer resources 430. These policies may be used to determine what hosts need to be optimized and where to place virtual machines during optimization. These policies do not determine what order to optimize the hosts.

Referring again to FIG. 4, the cloud manager 410 allows the system administrator 412 to set up and manage physical computer resources 430. Computer resources 430 represent physical computer resources such as physical host computer systems in a cloud computing environment. A set of computer resources managed as a group is sometimes referred to as a “cloud”. In the illustrated example, the computer resources (or cloud) 430 includes one or more physical computer hosts 440. The physical computer hosts 440 may be located remotely from the cloud manager. A host is a physical computer accessible over a network to the cloud manager. A host 440 typically has a hypervisor (software) that allows the host 440 to run one or more virtual machines as known in the prior art. As shown in FIG. 4, computer resources 430 include one or more hosts 440 such as host1 442. In this example, host1 442 has two virtual machines, namely: VM1 444 and VM2 446.

As introduced above, the ordering policy mechanism 350 dynamically changes ordering of optimization of physical hosts. In the illustrated example in FIG. 4, the ordering policy mechanism (OPM) 350 includes ordering policies 422. The ordering policies 422 may be stored in memory with the OPM 350 or any memory associated with or accessible to the cloud manager 410. The OPM 350 uses the ordering policies to determine the order of optimization of the physical hosts 440 of the cloud 430 as described further herein.

FIG. 5 is a block diagram that illustrates a simplified example of autonomically changing the order of host optimization. Blocks with the same reference numbers represent the same entities as introduced in FIG. 4. In this example, we assume the optimizer 416 has determined there are three hosts that need to be optimized, namely host1 510, host2 512 and host3 514. The optimizer 416 may use optimization policies 418 (FIG. 4) similar to the manner known in the prior art to determine these three physical hosts need to be optimized where the three hosts have violated an optimization policy 418. Having established that these three hosts need to be optimized, the ordering policy mechanism 350 uses ordering policies 422 and host conditions 518 to determine an optimization order 520 as described further below. In this example, the ordering policy mechanism 350 has determined to first optimize host2 512. The ordering policy mechanism 350 provides an order 520 that indicates to first optimize host2 512. In this example, the optimizer 350 then optimizes host2 512 by moving a virtual machine 522 to host4 516. The determination to move the virtual machine 522 may be made using the optimization policies 418 (FIG.4).

Again referring to FIG. 5, the ordering policies 422 comprises fixed policies 530 and dynamic policies 532. The ordering policies 422 may be set up by the system administrator 412 in a manner similar to other policies. The fixed policies 530 may comprise host priority sequence policies 534 and host priority level policies 536. A host priority sequence policy may be represented as a simple sequence or list of hosts that are given priority when optimizing. In the example in FIG. 5, a host priority sequence policy may be represented as “host2, host1, host3, host 4”. A host priority level policy 536 is a policy where a priority level is assigned to each host. The priority level for each host may be stored as a table or other suitable data structure in the memory with the ordering policies 422. For example, the host priority level 536 may include a level 1 through level 5. Each host is then assigned a level from level 1 through level 5. The host priority level policy would then first process the identified hosts having the highest host priority level.

Again referring to FIG. 5, the ordering policies 422 also comprise dynamic ordering policies 532. The dynamic ordering policies 532 may be described by an expression 538 which includes on one or more hosts and one or more host conditions 522. Examples of host conditions that may be used include time based conditions, economic conditions or utilization conditions. For example, time based conditions may include the time of the day, day of the week, holidays, etc. Economic conditions may include the various costs associated with the hosts. For example, an economic condition could include the costs per processor being charged to a client or the cost for memory. Utilization conditions may include the percentage of utilization of a processor, memory or network.

The dynamic host ordering policies 532 may be in the form of an expression or a function that returns an order of hosts for optimization depending on the host conditions 518 as shown in FIG. 5. The dynamic host ordering policies 532 may also be used in conjunction with the fixed host ordering policies 530. Some examples of dynamic ordering policies are as follows.

-   -   1. Choose the host with the highest processor utilization above         its violation policy. For example, if the utilization threshold         is 75%, hostA has CPU utilization of 98% and hostB has CPU         utilization of 76%, it may be best to optimize hostA before         hostB where hostB barely violates the threshold.         -   2. Choose the host with the higher costs per processor             cycle. This may be important with a utility-billed model             where the user pays per cycle of processor use where it may             be possible to reduce the CPU utilization of a host that             costs more before another host that costs less per cycle.     -   3. Choose the host with critical workloads (VMs), especially if         the critical workloads are pinned to the host (i.e., they can't         be migrated away) but other non-critical VMs are not.     -   4. Choose the host that contains VMs (or the hosts themselves)         that have a service level agreement (SLA) with the user         regarding host performance

As described above with reference to FIG. 5, the ordering policies 422 may comprise dynamic ordering policies 532 and fixed host ordering policies 520. The dynamic host ordering policies 532 may be used in conjunction with the fixed host priorities 530. In one example, the ordering policy mechanism 350 allows the system administrator to 412 to set up whether to give priority to fixed ordering policies 530 or dynamic ordering policies 532. Alternatively, the dynamic ordering policies 532 could include within the expression a priority for the different policies. For example, dynamic ordering policies may be as follows: choose the host with the highest processor cost and the highest host priority level.

We will now consider an example of dynamically setting the order of optimization of physical hosts. We assume there are eight hosts in the environment, identified with letters A through H. Each host has a cost per processor cycle defined below, where each numeric value is in an appropriate unit:

-   {‘A’: {‘cost_per_cycle’: 1}, -   ‘B’: {‘cost_per_cycle’: 2}, -   ‘C’: {‘cost_per_cycle’: 1}, -   ‘D’: {‘cost_per_cycle’: 3}, -   ‘E’: {‘cost_per_cycle’: 1}, -   ‘F’: {‘cost_per_cycle’: 1}, -   ‘G’: {‘cost_per_cycle’: 1}, -   ‘H’: {‘cost_per_cycle’: 4}

In the above example, the list of hosts is first sorted on a dynamic ordering policy. In this case, it is the cost_per_cycle. Note that this ordering policy could be more complex to include sorting by other conditions such as processor utilization and SLA percentage, and other conditions that change over time. In this case, we would be left with an ordered list as follows:

-   [(‘H’, {‘cost_per_cycle’: 4}), -   (‘D’, {‘cost_per_cycle’: 3}), -   (‘B’, {‘cost_per_cycle’: 2}), -   (‘A’, {‘cost_per_cycle’: 1}), -   (‘C’, {‘cost_per_cycle’: 1}), -   (‘E’, {‘cost_per_cycle’: 1}), -   (‘G’, {‘cost_per cycle’: 1}), -   (‘F’, {‘cost_per_cycle’: 1})]

In this example, we further assume the user has defined a fixed ordering policy with a host priority sequence of [‘C’, ‘D’, ‘B’]. This means that hosts C, D, B should be optimized (in that order) if indicated by the optimization policies before optimizing any other hosts. The list is modified according to this fixed ordering policy resulting in a new ordered list as follows:

-   [(‘C’, {‘cost_per_cycle’: 1}), -   (‘D’, {‘cost_per_cycle’: 3}), -   (‘B’, {‘cost_per_cycle’: 2}), -   (‘H’, {‘cost_per_cycle’: 4}), -   (‘A’, {‘cost_per_cycle’: 1}), -   (‘E’, {‘cost_per_cycle’: 1}), -   (‘G’, {‘cost_per cycle’: 1}), -   (‘F’, {‘cost_per_cycle’: 1})]

This ordered list is then passed to the optimizer to use to determine in what order to optimize violated hosts. If the optimizer determines that the list of hosts that need to be optimized is [‘B’, ‘C’, ‘D’, ‘F’, ‘H’], for example, then the optimizer would optimize the hosts in this order: [‘C’, ‘D’, ‘B’, ‘H’, ‘F’], which is done by sorting the list of violated hosts using the ordering list determined above.

FIG. 6 illustrates a flow diagram of a method 600 for dynamically setting the order of optimization of physical hosts in a computer environment. The method 600 is presented as a series of steps performed by a computer software program such as the ordering policy mechanism 350 described above. First, get the current conditions of the system (computer resources) (step 610). Get the ordering policies for the physical hosts (step 620). Evaluate the policies using the current conditions (step 630). Provide the optimizer with an ordered list to optimize the physical hosts (step 640). Optimize the physical hosts in the order of the ordered list (step 650). The method 600 is then done.

Referring now to FIG. 7, a flow diagram shows method 700 that is an exemplary method for performing step 630 in method 600 dynamically setting the order of optimization of physical hosts in a computer environment. The method 700 is presented as a series of steps performed by a computer software program such as the policy ordering mechanism 350 described above. First, create a list of all hosts using the current conditions and dynamic ordering policies (step 710). Order the lists of hosts based on a fixed ordering policy (step 720). Return the ordered list of hosts (step 730). The method 700 is done.

The claims and disclosure herein provide an apparatus and method for dynamically setting the order of optimization of physical hosts with fixed ordering policies and/or dynamic ordering policies to allow more efficient and varied optimization of a computer environment such as a cloud environment.

One skilled in the art will appreciate that many variations are possible within the scope of the claims. Thus, while the disclosure is particularly shown and described above, it will be understood by those skilled in the art that these and other changes in form and details may be made therein without departing from the spirit and scope of the claims. 

1-10. (canceled)
 11. A computer-implemented method for optimizing placement of virtual machines on physical hosts of a computer system, the method comprising: getting current conditions of the computer system; getting at least one ordering policy defined by a system administrator; evaluating the at least one ordering policy defined by the system administrator using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts; providing to an optimizer the ordered list of physical hosts that indicates a priority the order for optimizing the plurality of physical hosts; and optimizing the physical hosts in the order of the ordered list.
 12. The method of claim 11 wherein providing to the optimizer the ordered list of physical hosts further comprises: creating a list of the physical hosts using the current conditions and the at least one ordering policy; further ordering the list of hosts based on a static ordering policy; and returning the ordered list of physical hosts.
 13. The method of claim 11 wherein the method is performed in a management layer of a cloud computing environment and wherein the physical hosts in the computer system are part of the cloud computing environment.
 14. (canceled)
 15. The method of claim 11 wherein the at least one ordering policy is a fixed host priority sequence.
 16. The method of claim 11 wherein the at least one ordering policy is a dynamic ordering policy that indicates a host priority based on at least one host condition.
 17. The method of claim 16 wherein the dynamic ordering policy is an expression that indicates a host priority based on the at least one host condition.
 18. The method of claim 11 further comprising optimizing hosts that have violated an optimization policy in the order of the ordered list.
 19. The method of claim 11 wherein optimizing the physical hosts with the ordered list comprises moving a virtual machine from a first physical host to a second physical host.
 20. A computer-implemented method for optimizing placement of virtual machines on physical hosts of a computer system, the method comprising: getting current conditions of the computer system; getting at least one ordering policy defined by a system administrator; evaluating the at least one ordering policy using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts; providing to an optimizer the ordered list of physical hosts that indicates a priority the order for optimizing the plurality of physical hosts comprising: creating a list of the physical hosts using the current conditions and the ordering policies; further ordering the list of hosts based on a static ordering policy; and returning the ordered list of hosts; optimizing the physical hosts with the ordered list by moving a virtual machine from a first physical host to a second physical host; and wherein the at least one ordering policy is a fixed host priority sequence.
 21. A computer-implemented method for optimizing placement of virtual machines on physical hosts of a computer system, the method comprising: getting current conditions of the computer system; getting a plurality of ordering policies defined by a system administrator; evaluating the plurality of ordering policies using the current conditions to create an ordered list that indicates an order for optimizing the plurality of hosts; and optimizing the physical hosts with the ordered list.
 22. The method of claim 21 further comprising providing to an optimizer the ordered list of physical hosts that indicates the order for optimizing the plurality of physical hosts comprising: creating a list of the physical hosts using the current conditions and the plurality of ordering policies; further ordering the list of hosts based on a static ordering policy; and returning the ordered list of physical hosts.
 23. The method of claim 21 wherein the method is performed in a management layer of a cloud computing environment and wherein the physical hosts in the computer system are part of the cloud computing environment.
 24. The method of claim 21 further comprising allowing a system administrator to define the plurality of ordering policies with a user interface.
 25. The method of claim 21 wherein the plurality of ordering policies includes a fixed host priority sequence.
 26. The method of claim 21 wherein the plurality of ordering policies includes a dynamic ordering policy that indicates a host priority based on at least one host condition.
 27. The method of claim 26 wherein the dynamic ordering policy is an expression that indicates the host priority based on the at least one host condition.
 28. The method of claim 21 further comprising optimizing hosts that have violated an optimization policy in the order of the ordered list.
 29. The method of claim 21 wherein optimizing the physical hosts with the ordered list comprises moving a virtual machine from a first physical host to a second physical host. 